Extractive Explanations for Interpretable Text Ranking
نویسندگان
چکیده
Neural document ranking models perform impressively well due to superior language understanding gained from pre-training tasks. However, their complexity and large number of parameters these (typically transformer-based) are often non-interpretable in that decisions can not be clearly attributed specific parts the input documents. In this article, we propose inherently interpretable by generating explanations as a by-product prediction decision. We introduce Select-And-Rank paradigm for ranking, where first output an explanation selected subset sentences document. Thereafter, solely use or selection make prediction, making first-class citizens process. Technically, treat sentence latent variable trained jointly with ranker final output. To end, end-to-end training technique utilizing reparameterizable sampling using Gumbel-max trick . conduct extensive experiments demonstrate our approach is competitive state-of-the-art methods. Our broadly applicable numerous tasks furthers goal building design Finally, present real-world applications benefit method.
منابع مشابه
Cluster Priority Based Sentence Ranking for Efficient Extractive Text Summaries
This paper presents a cluster priority ranking based approach for extractive automatic text summarization that aggregates different cluster ranks for final sentence scoring. This approach does not require any learning, feature weighting and semantic processing. Surface level features combinations are used for individual cluster scoring. Proposed approach produces quality summaries without using...
متن کاملBiogeography-Based Optimization Algorithm for Automatic Extractive Text Summarization
Given the increasing number of documents, sites, online sources, and the users’ desire to quickly access information, automatic textual summarization has caught the attention of many researchers in this field. Researchers have presented different methods for text summarization as well as a useful summary of those texts including relevant document sentences. This study select...
متن کاملGraph Ranking on Maximal Frequent Sequences for Single Extractive Text Summarization
We suggest a new method for the task of extractive text summarization using graph-based ranking algorithms. The main idea of this paper is to rank Maximal Frequent Sequences (MFS) in order to identify the most important information in a text. MFS are considered as nodes of a graph in term selection step, and then are ranked in term weighting step using a graphbased algorithm. We show that the p...
متن کاملMAGIX: Model Agnostic Globally Interpretable Explanations
Explaining the behavior of a black box machine learning model at the instance level is useful for building trust. However, what is also important is understanding how the model behaves globally. Such an understanding provides insight into both the data on which the model was trained and the generalization power of the rules it learned. We present here an approach that learns rules to explain gl...
متن کاملInterpretable and Informative Explanations of Outcomes
In this paper, we solve the following data summarization problem: given a multi-dimensional data set augmented with a binary attribute, how can we construct an interpretable and informative summary of the factors affecting the binary attribute in terms of the combinations of values of the dimension attributes? We refer to such summaries as explanation tables. We show the hardness of constructin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Information Systems
سال: 2023
ISSN: ['1558-1152', '1558-2868', '1046-8188', '0734-2047']
DOI: https://doi.org/10.1145/3576924